The Multiplicative Group Generated by the Lehmer Numbers
نویسندگان
چکیده
That is, U is the range of the sequence (un)n>o. In this paper, we look at the set G(u) D N . Certainly, U C G(u) D N C N . It is easy to see that the extreme cases of the above inclusions can occur in some non-trivial instances. For example, if un = n\ for all n > 0, then m = um/um-i for all ra > 1, therefore G(u) = N . However, if (un)n>o is an arithmetical progression of first term 1 and difference k > 1, then G(u) D N = U. Indeed, notice that 1 = UQ E 17, and that if we write some rn E G{u) n N , m ^ l a s
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملChapter 9 Random Numbers
This chapter describes algorithms for the generation of pseudorandom numbers with both uniform and normal distributions. This is the first number produced by the Matlab random number generator with its default settings. Start up a fresh Matlab, set format long, type rand, and it's the number you get. If all Matlab users, all around the world, all on different computers, keep getting this same n...
متن کاملMultiplicative B-product and Its Properties
The author considers a special kind of B-product which is called the multiplicative B-product. The most important property of multiplicative B-product is that it preserves multiplicativity of functions. In the previous work [1], the author showed a new kind of convolution product called the B-product defined as follows. For every natural number n let Bn be the set of some pairs (r, s) of diviso...
متن کاملNew Pseudorandom Sequences Constructed by Quadratic Residues and Lehmer Numbers
Let p be an odd prime. Define en = { (−1), if n is a quadratic residue mod p, (−1)n+n+1, if n is a quadratic nonresidue mod p, where n is the multiplicative inverse of n modulo p such that 1 ≤ n ≤ p − 1. This paper shows that the sequence {en} is a “good” pseudorandom sequence, by using the properties of exponential sums, character sums, Kloosterman sums and mean value theorems of Dirichlet L-f...
متن کاملAn A Priori Determination of Serial Correlation in Computer Generated Random Numbers
1. Background. Ever since John Von Neumann introduced the "mid-square" method some ten years ago [11], users of "pseudo-random" numbers on modern digital computers have been generating their numbers as they were required in application, rather than drawing them from a table formed beforehand or obtaining them from a special-purpose device built expressly for this service. The advantages of Von ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010